Computing With Polynomials: A Personal Odyssey
نویسنده
چکیده
This paper chronicles my recent work in polynomial computation. Rather than focusing on a single coherent theme, my narrative includes the diverse nitty-gritty details I had to take care of and the choices that I made—and in some cases, rethought multiple times—while pursuing my dual goals of solving particular problems and finding the best framework for solving similar problems in the future. My own future efforts, at least, will benefit from this consolidation of my experience; I certainly hope that others may find some interesting nuggets among my various adventures as well. Here I will focus more on the computational aspects than on the mathematical aspects.
منابع مشابه
Odyssey: a high-performance clustered video server
Video servers are essential in Video-on-Demand and other multimedia applications. In this paper, we present our high-performance clustered CBR video server, Odyssey. Odyssey is a server connecting PCs with switched Ethernet. It provides efficient support for normal play and interactive browsing functions such as fast-forward and fast-backward. We designed a set of algorithms for scheduling, syn...
متن کاملComputing Vertex PI, Omega and Sadhana Polynomials of F12(2n+1) Fullerenes
The topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. The vertex PI polynomial is defined as PIv (G) euv nu (e) nv (e). Then Omega polynomial (G,x) for counting qoc strips in G is defined as (G,x) = cm(G,c)xc with m(G,c) being the number of strips of length c. In this paper, a new infinite class of fullerenes is constructed. ...
متن کاملComputing the First and Third Zagreb Polynomials of Cartesian Product of Graphs
Let G be a graph. The first Zagreb polynomial M1(G, x) and the third Zagreb polynomial M3(G, x) of the graph G are defined as: ( ) ( , ) [ ] e uv E G G x x d(u) + d(v) M1 , ( , ) euvE(G) G x x|d(u) - d(v)| M3 . In this paper, we compute the first and third Zagreb polynomials of Cartesian product of two graphs and a type of dendrimers.
متن کاملA spectral method based on Hahn polynomials for solving weakly singular fractional order integro-differential equations
In this paper, we consider the discrete Hahn polynomials and investigate their application for numerical solutions of the fractional order integro-differential equations with weakly singular kernel .This paper presented the operational matrix of the fractional integration of Hahn polynomials for the first time. The main advantage of approximating a continuous function by Hahn polynomials is tha...
متن کاملSome results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کامل